Computing Adequately Permissive Assumptions for Synthesis

Abstract We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the to allow system player win. Given $$\omega $$ -regular winning condition $$\varPhi for player, we assumption $$\varPsi such that (i) every strategy compliant with allows fulfill (sufficiency), (ii) can be fulfilled by (implementability), and (iii) does not prevent any cooperative choice (permissiveness). For parity games, are canonical representations present polynomial-time algorithm symbolic computation adequately permissive show our runs faster produces better than existing approaches—both theoretically empirically. To best knowledge, provide first sufficient implementable also .